Maximal and minimal realizations of reaction kinetic systems: computation and properties
نویسندگان
چکیده
This paper presents new results about the optimization based generation of chemical reaction networks (CRNs) of higher deficiency. Firstly, it is shown that the graph structure of the realization containing the maximal number of reactions is unique if the set of possible complexes is fixed. Secondly, a mixed integer programming based numerical procedure is given for computing a realization containing the minimal/maximal number of complexes. Moreover, the linear inequalities corresponding to full reversibility of the CRN realization are also described. The theoretical results are illustrated on meaningful examples.
منابع مشابه
Computing reaction kinetic realizations of positive nonlinear systems using mixed integer programming
The reaction kinetic realizations of nonnegative polynomial systems are studied in this paper. It is brie y reviewed that a wide class of positive systems can be written in or simply transformed to kinetic form. Based on the structure of kinetic realizations, valuable information can be obtained about the dynamical properties of the investigated systems using the results of chemical reaction ne...
متن کاملComputing zero deficiency realizations of kinetic systems
In the literature, there exist strong results on the qualitative dynamical properties of chemical reaction networks (also called kinetic systems) governed by the mass action law and having zero deficiency. However, it is known that different network structures with different deficiencies may correspond to the same kinetic differential equations. In this paper, an optimization-based approach is ...
متن کاملComputing all possible graph structures describing linearly conjugate realizations of kinetic systems
In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations using linear programming. Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, b...
متن کاملReaction Network Realizations of Rational Biochemical Systems and Their Structural Properties
In this paper, a frequently used representation of mass-action type reaction networks is extended to a more general system class where the reaction rates are in rational function form. An algorithm is given to compute a possible reaction graph from the kinetic differential equations. However, this structure is generally non-unique, as it is illustrated through the phenomenon of dynamical equiva...
متن کاملFinding complex balanced and detailed balanced realizations of chemical reaction networks
Reversibility, weak reversibility and deficiency, detailed and complex balancing are generally not "encoded" in the kinetic differential equations but they are realization properties that may imply local or even global asymptotic stability of the underlying reaction kinetic system when further conditions are also fulfilled. In this paper, efficient numerical procedures are given for finding com...
متن کامل